Automatic Streaming Processing of XSLT Transformations Based on Tree Transducers

نویسنده

  • Jana Dvoráková
چکیده

Streaming processing of XML transformations is practically needed especially when large XML documents or XML data streams are to be transformed. In this paper, the design of an automatic streaming processor for XSLT transformations is presented. Unlike other similar systems, our processor guarantees bounds on the resource usage for the processing of a particular type of transformation. This feature is achieved by employing tree transducers as the underlying formal base. The processor includes a set of streaming algorithms, each of them is associated with a tree transducer with specific resource usage (memory, number of passes), and thus captures different transformation subclass. The input XSLT stylesheet is analyzed in order to identify the transformation subclass to which it belongs. Then the lowest resourceconsuming streaming algorithm capturing this subclass is applied.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normalization and Learning of Transducers on Trees and Words. (Normalisation et Apprentissage de Transducteurs d'Arbres et de Mots)

Since the arrival of the Web, various kinds of semi-structured data formats were introduced in the areas of computer science and technology relevant for the Web, such as document processing, database management, knowledge representation, and information exchange. The most recent technologies for processing semi-structured data rely on the formats Json and Rdf. The main questions there are how t...

متن کامل

On normalization and type checking for tree transducers

Tree transducers are an expressive formalism for reasoning about tree structured data. Practical applications range from XSLT-like document transformations to translations of natural languages. Important problems for transducers are to decide whether two transducers are equivalent, to construct normal forms, give semantic characterizations, and type checking, i.e., to check whether the produced...

متن کامل

TYPECHECKING K-PEBBLE TREE TRANSDUCERS: PRACTICAL EFFICIENCY k-Pebble Tree Transducerに対する静的型検査の実効率 by

Recently, much attention has been drawn on exact typechecking for non-Turing-complete XML transformation languages, such as XSLT and XML-QL. Milo, Suciu, and Vianu proposed a notion of k-pebble tree transducers, a powerful and general framework that can express most of transformations in such languages, and showed that its exact typechecking is decidable in time hyper-exponential to the number ...

متن کامل

A Low-Memory SSXT Algorithm for XSLT Transformations

We present an implementation of the Xord framework for streaming processing of XSLT transformations based on .Net technologies. Within the framework, we implement an efficient streaming algorithm, called the SSXT algorithm, capable to process a significant subset of top-down XSLT transformations. We exactly characterize this class of transformations and implement schema-based analyzer which, fo...

متن کامل

Specifying transformations for XML data

Transformation of XML data is especially important when XML is used as the universal data interchange format among Web-based applications or in Web publishing. To perform such transformation we can use W3C’s XSLT or XQuery, which, however, require programming skills. In the paper we propose a descriptive high-level method to specify transformation. The method is based on the idea of unranked tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007